Long-range temporal correlations in scale-free neuromorphic networks
نویسندگان
چکیده
منابع مشابه
Degree Correlations in Directed Scale-Free Networks
Scale-free networks, in which the distribution of the degrees obeys a power-law, are ubiquitous in the study of complex systems. One basic network property that relates to the structure of the links found is the degree assortativity, which is a measure of the correlation between the degrees of the nodes at the end of the links. Degree correlations are known to affect both the structure of a net...
متن کاملGenetic contributions to long-range temporal correlations in ongoing oscillations.
The amplitude fluctuations of ongoing oscillations in the electroencephalographic (EEG) signal of the human brain show autocorrelations that decay slowly and remain significant at time scales up to tens of seconds. We call these long-range temporal correlations (LRTC). Abnormal LRTC have been observed in several brain pathologies, but it has remained unknown whether genetic factors influence th...
متن کاملQuantifying long-range correlations in complex networks beyond nearest neighbors
We propose a fluctuation analysis to quantify spatial correlations in complex networks. The approach considers the sequences of degrees along shortest paths in the networks and quantifies the fluctuations in analogy to time series. In this work, the Barabasi-Albert (BA) model, the Cayley tree at the percolation transition, a fractal network model, and examples of real-world networks are studied...
متن کاملTemporal Dynamics of Scale-Free Networks
Many social, biological, and technological networks display substantial non-trivial topological features. One well-known and much studied feature of such networks is the scale-free power-law distribution of nodes’ degrees. Several works further suggest models for generating complex networks which comply with one or more of these topological features. For example, the known Barabasi-Albert ”pref...
متن کاملIntrinsic degree-correlations in static scale-free networks
We calculate the mean neighboring degree function k̄nn(k) and the mean clustering function C(k) of vertices with degree k as a function of k in finite scale-free random networks through the static model. While both are independent of k when the degree exponent γ ≥ 3, they show the crossover behavior for 2 < γ < 3 from k-independent behavior for small k to k-dependent behavior for large k. The k-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Network Neuroscience
سال: 2020
ISSN: 2472-1751
DOI: 10.1162/netn_a_00128